full semigroup

См. также в других словарях:

• Semigroup action — In algebra and theoretical computer science, an action or act of a semigroup on a set is a rule which associates to each element of the semigroup a transformation of the set in such a way that the product of two elements of the semigroup (using… …   Wikipedia

• Transformation semigroup — In algebra, a transformation semigroup (or composition semigroup) is a collection of functions from a set to itself which is closed under function composition. If it includes the identity function, it is a transformation (or composition) monoid.… …   Wikipedia

• Regular semigroup — A regular semigroup is a semigroup S in which every element is regular, i.e., for each element a , there exists an element x such that axa = a . [Howie 1995 : 54.] Regular semigroups are one of the most studied classes of semigroups, and their… …   Wikipedia

• Bicyclic semigroup — In mathematics, the bicyclic semigroup is an algebraic object important for the structure theory of semigroups. Although it is in fact a monoid, it is usually referred to as simply a semigroup. The first published description of this object was… …   Wikipedia

• Topological semigroup — In mathematics, a topological semigroup is a semigroup which is simultaneously a topological space, and whose semigroup operation is continuous. [Artur Hideyuki Tomita. [http://tatra.mat.savba.sk/Full/14/10tomita.ps On sequentially compact both… …   Wikipedia

• Special classes of semigroups — In mathematics, a semigroup is a nonempty set together with an associative binary operation. A special class of semigroups is a class of semigroups satisfying additional properties or conditions. Thus the class of commutative semigroups consists… …   Wikipedia

• Monoid — This article is about the mathematical concept. For the alien creatures in the Doctor Who adventure, see The Ark (Doctor Who). Coherence law for monoid unit In abstract algebra, a branch of mathematics, a monoid is an algebraic structure with a… …   Wikipedia

• Inverse element — In abstract algebra, the idea of an inverse element generalises the concept of a negation, in relation to addition, and a reciprocal, in relation to multiplication. The intuition is of an element that can undo the effect of combination with… …   Wikipedia

• Green's relations — In mathematics, Green s relations are five equivalence relations that characterise the elements of a semigroup in terms of the principal ideals they generate. The relations are named for James Alexander Green, who introduced them in a paper of… …   Wikipedia

• Moore–Penrose pseudoinverse — In mathematics, and in particular linear algebra, a pseudoinverse A+ of a matrix A is a generalization of the inverse matrix.[1] The most widely known type of matrix pseudoinverse is the Moore–Penrose pseudoinverse, which was independently… …   Wikipedia

• Exponentiation by squaring — Exponentiating by squaring is an algorithm used for the fast computation of large integer powers of a number. It is also known as the square and multiply algorithm or binary exponentiation. In additive groups the appropriate name is double and… …   Wikipedia